The Geom/G/1 Queue with Bernoulli Feedback and Server Setup/Closedown Times

نویسندگان

  • Songfang Jia
  • Yanheng Chen
چکیده

In this paper ,we discuss the Geom/G/1 queue with Bernoulli feedback and server setup/closedown times.We derive the probability generating function (PGF) of the steady-state queue length immediately after a service completion by the embedded Markov chain and the PGF of the queue length immediately after an arbitrary slot boundary .We also get the PGF of the stationary waiting times under first come first service (FCFS) service discipline .From the results ,we obtain the conclusion the steady-state queue length and waiting times have the property of stochastic decomposition .Finally,we get the generating function of busy period and give several special cases to verify the effect of our model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

International Journal of Management Science and Engineering Management

In this paper, we discuss the discrete-time Geom/G/1 queue with multiple adaptive vacations and server setup/closedown times. We consider two types of closedown time policies which differ from each other in the completion instant of the closedown times and contrast the effects of them on the queueing system. We derive the probability generating functions (PGFs) and stochastic decomposition resu...

متن کامل

Unreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service

This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...

متن کامل

Analysis of a Geo/G/1 Queueing System with a Generalized N-Policy and Setup-Closedown Times

Abstract: We analyze a discrete-time single-server queueing system whose arrival stream is a Bernoulli process and service times are generally distributed. An extension of the N -policy is considered: the server remains idle till the queue length becomes 1 i ≥ with probability i θ . After the idle (vacation) period, the server needs a random amount of startup time before serving. Moreover, afte...

متن کامل

A <V, p>-Policy Queueing System with Startup/Closedown Times

This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical sin...

متن کامل

ON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION

This paper analyzes a renewal input  working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011